Gate complexity using dynamic programming
نویسندگان
چکیده
منابع مشابه
Solving the flight gate assignment problem using dynamic programming
This paper considers the problem of assigning flights to airport gates—a problem which is NP-hard in general. We focus on a special case in which the maximization of flight/gate preference scores is the only objective. We show that for a variable number of flights and gates, this problem is still NP-hard. For a fixed number of gates, we present a dynamic programming approach that solves the fli...
متن کاملThe complexity of dynamic programming
This paper addresses issues related to the computational complexity of solving discrete-time stochastic control problems defined on a continuous state space. There has been a great deal of research on the computational aspects of stochastic control when the state space is finite (Bertsekas, 1987; Papadimitriou and Tsitsiklis, 1987; Hartley et al., 1980). However, much less has been accomplished...
متن کاملTropical Complexity, Sidon Sets, and Dynamic Programming
Many dynamic programming algorithms for discrete 0-1 optimization problems are just special (recursively constructed) tropical (min,+) or (max,+) circuits. A problem is homogeneous if all its feasible solutions have the same number of 1s. Jerrum and Snir [JACM 29 (1982), pp. 874– 897] proved that tropical circuit complexity of homogeneous problems coincides with the monotone arithmetic circuit ...
متن کاملSustainable Management of Saravan Sylvan Park Using Stochastic Dynamic Programming
The present study sustainable management of Guilan Saravan Sylvan Park was planned. The used method in the form of decision support model in three10-year period was studied for parks of various states and with considering the economic, ecological and social criteria during the years 2008 to 2038. By using hierarchical fuzzy analysis method, the reaching to an optimal level of economic, ecologic...
متن کاملSolving a Two-Period Cooperative Advertising Problem Using Dynamic Programming
Cooperative advertising is a cost-sharing mechanism in which a part of retailers' advertising investments are financed by the manufacturers. In recent years, investment among advertising options has become a difficult marketing issue. In this paper, the cooperative advertising problem with advertising options is investigated in a two-period horizon in which the market share in the second period...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2008
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.78.052327